A 4/3 OPT+2/3 Approximation for Big Two-Bar Charts Packing Problem
نویسندگان
چکیده
We consider the two-bar charts packing problem generalizing strongly NP-hard bin problem. prove that remains even if each chart has at least one bar higher than 1/2. If first (or second) of is 1/2, we show O(n2)-time greedy algorithm with lexicographic ordering constructs a length most OPT+1, where OPT optimum, and present an O(n2.5)-time 4/3 ・ OPT+2/3 in case
منابع مشابه
Bin Packing Problem: Two Approximation Algorithms
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n), unlessP=NP. In this paper, first, a -approximation algorithm is presented, then a modification to FFD ...
متن کاملA Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملApproximation algorithms for a hierarchically structured bin packing problem
In this paper we study a variant of the bin packing problem in which the items to be packed are structured as the leaves of a tree. The problem is motivated by document organization and retrieval. We show that the problem is NP-hard and we give approximation algorithms for the general case and for the particular case in which all the items have the same size.
متن کاملHierarchical Pixel Bar Charts
Simple presentation graphics are intuitive and easy-to-use, but only show highly aggregated data. Bar charts, for example, only show a rather small number of data values and x-y-plots often have a high degree of overlap. Presentation techniques are often chosen depending on the considered data type—bar charts, for example, are used for categorical data and x-y plots are used for numerical data....
متن کاملScale-Stack Bar Charts
It is difficult to create appropriate bar charts for data that cover large value ranges. The usual approach for these cases employs a logarithmic scale, which, however, suffers from issues inherent to its non-linear mapping: for example, a quantitative comparison of different values is difficult. We present a new approach for bar charts that combines the advantages of linear and logarithmic sca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2023
ISSN: ['1072-3374', '1573-8795']
DOI: https://doi.org/10.1007/s10958-023-06319-y